On Weak Lumpability of Denumerable Markov Chains
نویسنده
چکیده
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In particular, the asymptotic interpretation of the quasi-stationary distribution is addressed and it is fruitfully used for weak lumpability of R-positive Markov chains. Furthermore, we present a simple example which shows that a denumerable Markov chain can be (weakly) lumped into a finite Markov chain. Finally, it is stated that weak lumpability for any continuous time Markov chain with an uniform transition semi-group can be handled in discrete time context. The sequel of this result are also discussed for irreducible positive-recurrent or -positive continuous time Markov chains. Key-words: Weak Lumpability, Positive recurrence, R-positivity, Quasi-stationary distribution, Uniform transition semi-group.
منابع مشابه
A geometric invariant in weak lumpability of finite Markov chains
We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...
متن کاملWeak Lumpability of Finite Markov Chains and Positive Invariance of Cones
We consider weak lumpability of general nite homogeneous Markov chains evolving in discrete time, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpabilityis equivalent to the existence of a decomposable polyhedral cone which is positively invariant by the transition probability matrix of the origi...
متن کاملExact and Ordinary Lumpability in Finite Markov Chainsy
Exact and ordinary lumpability in nite Markov chains is considered. Both concepts naturally deene an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on...
متن کاملA necessary condition for weak lumpability in finite Markov processes
Under certain conditions, the state space of a homogeneous Markov process can be partitionned to construct an aggregated markovian process. However, the verification of these conditions requires expensive computations. In this note, we expose a necessary condition for having a markovian aggregated process. This condition is based on properties of the eigenvalues of certain submatrices of the tr...
متن کاملAnalysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains.
The most commonly used models for analysing local dependencies in DNA sequences are (high-order) Markov chains. Incorporating knowledge relative to the possible grouping of the nucleotides enables to define dedicated sub-classes of Markov chains. The problem of formulating lumpability hypotheses for a Markov chain is therefore addressed. In the classical approach to lumpability, this problem ca...
متن کامل